Fixed-Equilibrium Rationalizability in Signaling Games*
نویسندگان
چکیده
This paper studies equilibrium refinements in signaling games through an examination of rationalizability in derived games obtained by replacing the equilibrium path with a sure outcome that yields the equilibrium payoff to ail players. The informed player chooses between the sure payoff and sending an out-of-equilibrium signal from the original game. Whether or not the strategy of choosing the sure payoff is rationalizable is related to the iterated intuitive condition (divinity) when the original game is viewed as having imperfect (incomplete) information. Our results also demonstrate the significance of testing out-of-equilibrium signals as a set rather than individually. Journal of Economic Literature Classification Numbers: 021, 022, 026.
منابع مشابه
Rationalization and Incomplete Information∗
We analyze a family of extensive-form solution procedures for games with incomplete information that do not require the specification of an epistemic type space à la Harsanyi, but can accommodate a (commonly known) collection of explicit restrictions ∆ on first-order beliefs. For any fixed ∆ we obtain a solution called ∆-rationalizability. In static games, ∆-rationalizability characterizes the ...
متن کاملRationalization in Signaling Games: Theory and Applications
Focusing on signaling games, I illustrate the relevance of the rationalizability approach for the analysis multistage games with incomplete information. I define a class of iterative solution procedures, featuring a notion of “forward induction”: the Receiver tries to explain the Sender’s message in a way which is consistent with the Sender’s strategic sophistication and certain given restricti...
متن کاملRationality and equilibrium in perfect-information games
In generic perfect-information games the unique Subgame-Perfect Equilibrium (SPE) outcome is identical to the one predicted by several rationalizability notions, like Extensive-Form Rationalizability (EFR), the Backward Dominance Procedure (BDP), and Extensive-Form Rationalizability of the Agent form (AEFR). We show that, in contrast, within the general class of perfect information games all th...
متن کاملSequential and quasi-perfect rationalizability in extensive games
Within an epistemic model for two-player extensive games, we formalize the event that each player believes that his opponent chooses rationally at all information sets. Letting this event be common certain belief yields the concept of sequential rationalizability. Adding preference for cautious behavior to this event likewise yields the concept of quasi-perfect rationalizability. These concepts...
متن کاملRe®nements of rationalizability for normal-form games*
There exist three equivalent de®nitions of perfect Nash equilibria which di ̈er in the way ``best responses against small perturbations'' are de®ned. It is shown that applying the spirit of these de®nitions to rationalizability leads to three di ̈erent re®nements of rationalizable strategies which are termed perfect (Bernheim, 1984), weakly perfect and trembling-hand perfect rationalizability, re...
متن کامل